Strategic Oscillation in Heuristic Local Search Strategic Oscillation in Heuristic Local Search
نویسنده
چکیده
Main area: search techniques. Abstract This paper describes a local search algorithm for combinatorial optimization problems. It is centered on strategic oscillation. This means that breaking some constraints is allowed so that the search oscillates between feasible and unfeasible elements. It includes global search principles too. In particular heuristic evaluation inspired from A* is used to guide the search. Performance is tested on the multidi-mensional knapsack problem. Experience prooves that the algorithm is very eecient, as well according to the quality of the found solutions as according to the search speed.
منابع مشابه
Augmented Downhill Simplex a Modified Heuristic Optimization Method
Augmented Downhill Simplex Method (ADSM) is introduced here, that is a heuristic combination of Downhill Simplex Method (DSM) with Random Search algorithm. In fact, DSM is an interpretable nonlinear local optimization method. However, it is a local exploitation algorithm; so, it can be trapped in a local minimum. In contrast, random search is a global exploration, but less efficient. Here, rand...
متن کاملOptimal Sensor Network Design and Upgrade using Tabu Search
In this work a Tabu Search heuristic is proposed to solve the optimal design and upgrade of sensor structures that satisfy both economic criteria and specific requirements on key variable estimates. The heuristic is based on the Strategic Oscillation Technique around the feasibility boundary, a procedure that has good intensification and diversification capabilities. Comparative performance stu...
متن کاملA 3-flip neighborhood local search for the set covering problem
The set covering problem (SCP) asks to choose a minimum cost family of subsets from given n subsets, which together covers the entire ground set. In this paper, we propose a local search algorithm for SCP, which have the following three features. (1) The use of 3ip neighborhood, which is the set of solutions obtainable from the current solution by exchanging at most three subsets. As the size o...
متن کاملStrategic oscillation for the capacitated hub location problem with modular links
The capacitated single assignment hub location problem with modular link capacities is a variant of the classical hub location problem in which the cost of using edges is not linear but stepwise, and the hubs are restricted in terms of transit capacity rather than in the incoming traffic. This problem was introduced by Yaman and Carello in [18] and treated by a branch-and-cut and a tabu search ...
متن کاملA Hybrid GRASP with Perturbations for the Steiner Problem in Graphs
We propose and describe a hybrid GRASP with weight perturbations and adaptive path-relinking heuristic (HGP-PR) for the Steiner problem in graphs. In this multi-start approach, the greedy randomized construction phase of a GRASP is replaced by the combination of several construction heuristics with a weight perturbation strategy that combines intensification and diversification elements, as in ...
متن کامل